Relating Multifunctions and Predicate Transformers through Closure Operators
نویسندگان
چکیده
We study relations between predicate transformers and mul-tifunctions in a topological setting based on closure operators. We give topological deenitions of safety and liveness predicates and using these predicates we deene predicate transformers. State transformers are mul-tifunctions with values in the collection of xed points of a closure operator. We derive several isomorphisms between predicate transformers and multifunctions. By choosing diierent closure operators we obtain multi-functions based on the usual power set construction, on the Hoare, Smyth and Plotkin power domains, and based on the compact and closed metric power constructions. Moreover, they are all related by isomorphisms to the predicate transformers.
منابع مشابه
Predicate Transformers, (co)Monads and Resolutions
This short note contains random thoughts about a factorization theorem for closure/interior operators on a powerset which is reminiscent to the notion of resolution for a monad/comonad. The question originated from formal topology but is interesting in itself. The result holds constructively (even if it classically has several variations); but usually not predicatively (in the sense that the in...
متن کاملA Relation-Algebraic Approach to Multirelations and Predicate Transformers
The correspondence between up-closed multirelations and isotone predicate transformers is well known. Less known is that multirelations have also been used for modelling topological contact, not only computations. We investigate how properties from these two lines of research translate to predicate transformers. To this end, we express the correspondence of multirelations and predicate transfor...
متن کاملL-fuzzy strongest postcondition predicate transformers as L-idempotent linear or affine operators between semimodules of monotonic predicates
For a completely distributive quantale L, L-fuzzy strongest postcondition predicate transformers are introduced, and it is shown that, under reasonable assumptions, they are linear or affine continuous mappings between continuous L-idempotent semimodules of L-fuzzy monotonic predicates. © 2012 Elsevier B.V. All rights reserved.
متن کاملThe Ehrenfeucht-Fraisse Games for Transitive Closure
We present in this paper Ehrenfeucht-Frai"sse games for the transitiveclosure logics DTC, TC and ATC. Although the existence of such games for logics with generalized quantifiers was known before, the exact formulation of these games for the predicate transformers arising from various transitive-closure-like operations is new. The games are sound and complete both for finite and infinite models...
متن کاملReasoning about efficiency within a probabilistic µ-calculus
Expectation-based probabilistic predicate transformers 15] provide a logic for probabilistic sequential programs, giving access to expressions such as`the probability that predicate A is achieved nally'. Using expectations more generally however, we can express-calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based-calculus such eeciency measu...
متن کامل